منابع مشابه
Pin assignment with global routing for VLSI building block layout
In this paper, we will consider global routing and pin assignment in VLSI building block layout, and present an efficient algorithm which integrates global routing, pin assignment, block reshaping and positioning. The general flow of the proposed algorithm is the same as the one proposed in [1] and consists of two main phases. The first phase is to determine not only global routes and coarse pi...
متن کاملA New Methodology for Vlsi Layout
U N C L A S S IF IE O /U N L IM IT E D 22 S AM E AS RPT. □ O T IC USERS □ 21. A B S T R A C T S E C U R IT Y C L A S S IF IC A T IO N Unclassified 22a. N A M E OF R ESPO N SIBLE IN D IV ID U A L 22b. T E LE P H O N E N U M 3E R (In c lu d e A re a C o d e) 22c. O F F IC E S Y M B O L >D FORM 1473, 33 APR E D IT IO N OF 1 JA N 73 IS O B S O LE TE . S E C U R I T Y C L A S S I F I C A T I O N C c...
متن کاملBipolar Device Modeling for VLSI Layout Verification
Today, layout verification for VLSI is a crucial part of IC design. However, for applicability, this must be both fast and accurate. Layout-to-circuit extractors can meet both these constraints. They quickly convert a layout into an equivalent network that accurately models that layout. Subsequently, circuit simulation and network comparison are convenient tools that enable accurate prediction ...
متن کاملMultilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...
متن کاملParallel Algorithms for VLSI Layout Verification
Layout veriication determines whether the polygons that represent diierent mask layers in the chip conform to the technology speciications. Commercial layout verii-cation programs can take tens of hours to run in the attened representations for large designs. It is therefore desirable to run the DRC problem in parallel to reduce the runtimes. Also, the memory requirements of large chips are suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90003-s